Recursive coalgebras of finitary functors
نویسندگان
چکیده
For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) A is recursive, i.e., A has a unique coalgebra-to-algebra morphism into any algebra, and (iii) A is parametrically recursive. And all these properties mean that the system described by A always halts in finitely many steps.
منابع مشابه
12345 efghi UNIVERSITY OF WALES SWANSEA
For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) A is recursive, i.e., A has a unique coalgebra-to-algebra morphism into any algebra, and (iii) A is parametrically recursive. And all these properties mean that the system described by A always halts in finitely many steps.
متن کاملA Note on Expressive Coalgebraic Logics for Finitary Set Functors
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L ∗ of the limit L of the first ω terms in the final sequence. L∗ is the set of points in L which arise from all coalgebras using their canonical morphisms into L, and it was used earlier for different purposes in Kurz and Pattinson [5]. Viglizzo in [11...
متن کاملOn descent for coalgebras and type transformations
We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...
متن کاملRegular Behaviours with Names
Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and α-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model, e.g., various forms of automata with names as well as infinite terms with variable binding operators (such as λ-abstraction). Here, we first study the behaviour of or...
متن کاملUltrafilter Extensions for Coalgebras
This paper studies finitary modal logics as specification languages for Set-coalgebras (coalgebras on the category of sets) using Stone duality. It is wellknown that Set-coalgebras are not semantically adequate for finitary modal logics in the sense that bisimilarity does not in general coincide with logical equivalence. Stone-coalgebras (coalgebras over the category of Stone spaces), on the ot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 41 شماره
صفحات -
تاریخ انتشار 2007